Matrix computations in linear superalgebra

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming Realization of Symbolic Computations for Non-linear Commutator Superalgebras over the Heisenberg-Weyl Superalgebra: Data Structures and Processing Methods

We suggest a programming realization of an algorithm for a verification of a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan procedure for a quadratic superalgebra and whose elements are realized as a formal power series with respect to noncommuting elements. To this end, we propo...

متن کامل

Regularized Matrix Computations

We review the basic results on: (1) the singular value decomposition (SVD); (2) sensitivity and conditioning of solutions of linear systems of equations; (3) regularization; and (4) iterative solution of linear systems of equations. These are applied to the specific problem of computing a matrix null vector. I. SINGULAR VALUE DECOMPOSITION A. Basics The singular value decomposition (SVD) of any...

متن کامل

Parallel Matrix Computations

In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, zve present algorithms that form the main module...

متن کامل

Fast Matrix Polynomial Computations

Pour une matrice polynomiale P(x) de degr e d dans Mn;n(Kx]), o u K est un corps commutatif, une r eduction a la forme normale d'Hermite peut ^ etre calcul ee en O ~ (M(nd)) op erations arithm etiques, si M(n) est le co^ ut du produit de deux matrices n n sur K. De plus, une telle r eduction peut ^ etre obtenue en temps parall ele O(log +1 (nd)) en utilisant O(L(nd)) processeurs, si le probl em...

متن کامل

Visualizing Sparse Matrix Computations

This paper describes ideas and tools that help with the visualization of sparse matrix computations. The paper uses the Sparse Matrix Manipulation System, an environment for handling sparse matrices of all types in a vy flexible manner via ASCII file interfaces. Two commands in this environment are ShowMalrix and ShowTree. The first illustrates the pattern of nonzeroes of a sparse matrix. The s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1988

ISSN: 0024-3795

DOI: 10.1016/0024-3795(88)90057-2